Dynamic fluid-based scheduling in a multi-class abandonment queue
نویسندگان
چکیده
منابع مشابه
Dynamic fluid-based scheduling in a multi-class abandonment queue
We investigate how to share a common resource among multiple classes of customers in the presence of abandonments. We consider two different models: (1) customers can abandon both while waiting in the queue and while being served, (2) only customers that are in the queue can abandon. Given the complexity of the stochastic optimization problemwe propose a fluid model as a deterministic approxima...
متن کاملMany-Server Fluid Queue with Abandonment
We consider the Gt/Mt/st + GIt many-server fluid queue with time-varying parameters, intended as an approximation for the corresponding stochastic queueing model, having general arrival process (the Gt), Markovian service (the Mt) and customer abandonment with mutually independent times to abandon with a general distribution (the +GIt) when there are many servers (the st) and the system experie...
متن کاملDynamic Scheduling of a Two-Class Queue with Setups
We analyze two scheduling problems for a queueing system with a single server and two customer classes. Each class has its own renewal arrival process, general service time distribution, and holding cost rate. In the first problem, a setup cost is incurred when the server switches from one class to the other, and the objective is to minimize the long-run expected average cost of holding custome...
متن کاملAdmission control for a multi-server queue with abandonment
In a M/M/N +M queue, when there are many customers waiting, it may be preferable to reject a new arrival rather than risk that arrival later abandoning without receiving service. On the other hand, rejecting new arrivals increases the percentage of time servers are idle, which also may not be desirable. We address these trade-offs by considering an admission control problem for a M/M/N +M queue...
متن کاملScheduling a Multi Class Queue with Many Exponential Servers : Asymptotic Optimality in Heavy Traffic
We consider the problem of scheduling a queueing system in which many statistically identical servers cater to several classes of impatient customers. Service times and impatience clocks are exponential while arrival processes are renewal. Our cost is an expected cumulative discounted function, linear or nonlinear, of appropriately normalized performance measures. As a special case, the cost pe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Performance Evaluation
سال: 2013
ISSN: 0166-5316
DOI: 10.1016/j.peva.2013.08.009